Serge Demeyer | Publications | E-mail Feedback
Last updated on Friday, July 18, 2025
@inproceedings{beyazit2022BENEVOL,
author = {Beyaz{\i}t, Mutlu and Demeyer, Serge},
booktitle = {Proceedings {BENEVOL 2022} (20th edition of the
BElgian-NEtherlands software eVOLution symposium)},
month = nov,
publisher = {CEUR Workshop Proceedings (CEUR-WS.org)},
title = {An experimental analysis of a near-optimal
graph-based test generation algorithm},
volume = {Vol-3567},
year = {2022},
abstract = {Graphs are widely used in model-based test
generation. A commonly used family of coverage
criteria is based on covering edge sequences of
length 𝑘 for 𝑘 >= 1. A near-optimal test
generation algorithm (which based on solving Chinese
postman problem) has a known algorithmic complexity
of O(V3k). While we cannot change the inherent
complexity of the algorithm, heuristics can heavily
improve upon the actual runtime of the algorithm. In
this paper, for the purpose of developing such a
heuristic, we illustrate the potential points of
improvement by means of an experimental analysis. Our
results suggest that the good coverage properties
displayed by the algorithm are prone to being
exploited to improve its runtime performance at least
for certain types of graphs.},
annote = {workshoppaper},
url = {https://ceur-ws.org/Vol-3567/},
}